// Sieve of Eurathsphen - Finding Prime numbers#include<stdio.h>#include<stdlib.h>#include<math.h>int main () {    int n,i,j,k,ans = 0;    int utku[1001] = {0};    scanf("%d %d",&n,&k);    int sz = 0;    // int a = (int*) malloc (sizeof(4)*4);    for (i=2; i*i <= n; i++) {        if(utku[i]==0){            for (j=i*i; j<=n; j+=i) {                utku[j]=1;            }        }    }    int prime[1001];    for (i = 2; i <= n; i++) {        if (utku[i] == 0) {            prime[sz++] = i;        }    }        for (i = 0; i < sz; i++) {        if (utku[1 + prime[i] + prime[i + 1]] == 0 && (1 + prime[i] + prime[i + 1] <= n)) {            ans++;        }    }    if(ans >= k){        printf("Yes");    }else        printf("No");    return 0;    }